منابع مشابه
Uniform Weak Tractability of Multivariate Problems
In this dissertation we introduce a new notion of tractability which is called uniform weak tractability. We give necessary and sufficient conditions on uniform weak tractability of homogeneous linear tensor product problems in the worst case, average case and randomized settings. We then turn to the study of approximation problems defined over spaces of functions with varying regularity with r...
متن کاملOn uniform weak König's lemma
The so-called weak König’s lemma WKL asserts the existence of an infinite path b in any infinite binary tree (given by a representing function f). Based on this principle one can formulate subsystems of higher-order arithmetic which allow to carry out very substantial parts of classical mathematics but are Π2-conservative over primitive recursive arithmetic PRA (and even weaker fragments of ari...
متن کاملOn weak tractability of the Clenshaw-Curtis Smolyak algorithm
We consider the problem of integration of d-variate analytic functions defined on the unit cube with directional derivatives of all orders bounded by 1. We prove that the Clenshaw Curtis Smolyak algorithm leads to weak tractability of the problem. This seems to be the first positive tractability result for the Smolyak algorithm for a normalized and unweighted problem. The space of integrands is...
متن کاملUniform Weak Implies Uniform Strong Persistence for Non-autonomous Semiflows
It is shown that, under two additional assumptions, uniformly weakly persistent semiflows are also uniformly strongly persistent even if they are non-autonomous. This result is applied to a time-heterogeneous model of S-I-R-S type for the spread of infectious childhood diseases. If some of the parameter functions are almost periodic, an almost sharp threshold result is obtained for uniform stro...
متن کاملOn the Uniform Weak König’s Lemma
The so-called weak König’s lemma WKL asserts the existence of an infinite path b in any infinite binary tree (given by a representing function f). Based on this principle one can formulate subsystems of higher-order arithmetic which allow to carry out very substantial parts of classical mathematics but are Π2conservative over primitive recursive arithmetic PRA (and even weaker fragments of arit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2013
ISSN: 0885-064X
DOI: 10.1016/j.jco.2013.04.006